Using algorithm visualizations in computer science education
نویسندگان
چکیده
منابع مشابه
Computer Science in Education
Computer science or computing science (sometimes abbreviated CS) is the learning of the theoretical foundations of information and computation, and of practical techniques for their execution and application in computer systems. It is often described as the efficient study of algorithmic processes that produce, explain, and transform information. In this work, I use Data Mining algorithms from ...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Problem Solving and Algorithm Education in Computer Science
Computer scientists are expected to be problem solvers, yet the current structure of algorithm education does not facilitate learning the necessary skills to do so. Learning objectives for algorithm education are defined and Bloom and SOLO taxonomy are employed to evaluate their complexity. Current algorithm curriculum, like that of Michigan State University, is examined and evaluated for e↵ect...
متن کاملSerious computer games in computer science education
The role and importance of serious computer games in contemporary educational practice is presented in this paper as well as the theoretical fundamentals that justify their use in different forms of education. We present a project for designing and developing serious games that take place within the curriculum for computer science teachers’ education as an independent project work in teams. In ...
متن کاملUsing Small-Step Refinement For Algorithm Verification In Computer Science Education
Stepwise program refinement techniques can be used to simplify program verification. Programs are better understood since their main properties are clearly stated, and verification of rather complex algorithms is reduced to proving simple statements connecting successive program specifications. Additionally, it is easy to analyze similar algorithms and to compare their properties within a singl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Computer Science
سال: 2014
ISSN: 2299-1093
DOI: 10.2478/s13537-014-0215-4